SEQUENTIAL HYBRIDIZATION ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM SOLVING

The traveling salesman problem is a combinatorial optimization problem. article presentsa statement of this and proposes graph mathematical model in which verticescorrespond to cities, edges are paths between it assumed that the isweighted. solution consists finding minimum weightHamiltonian cycle complete weighted graph. NP-hard, so heuristic approachis used solve speed up on large volumes ofinput data. applying hybridization two algorithms travelingsalesman problem: annealing simulation algorithm nearest neighbor algorithm. Sequentialhybridization scheme basic idea isthat method launched initial set solutions, then best solutionof first stage fed details construction,flowcharts hybrid algorithm, nearestneighbor method. goes describe user interface application written inTypescript. uses an area map as Inthe last part article, comparative analysis algorithms' performance highlighted: acomparison accuracy operating time developed for different input data sets. It was establishedthat second place terms interms quality among implemented algorithms. In addition, solutionhas high economic practical value because solving salesmanproblem, therefore route navigation, can replace existing analogues or itcan be any narrowly focused areas, well logistics.